Connectedness in fine topologies

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Genetic Algorithms And Fine-grained Topologies For Optimization

In this paper we show how the performance of two meta-heuristic algorithms and two simple search routines varies as these algorithms are applied singly, in pairwise combinations, and in larger, finer-grained combinations. The area of application is f6 and f17, two well-known optimization benchmark problems. Our conclusion is that when these algorithms are combined in complex ways, their perform...

متن کامل

On Generalized Injective Spaces in Generalized Topologies

In this paper, we first present a new type of the concept of open sets by expressing some properties of arbitrary mappings on a power set. With the generalization of the closure spaces in categorical topology, we introduce the generalized topological spaces and the concept of generalized continuity and become familiar with weak and strong structures for generalized topological spaces. Then, int...

متن کامل

Connectedness in graph limits

We define direct sums and a corresponding notion of con-nectedness for graph limits. Every graph limit has a unique decomposition as a direct sum of connected components. As is well-known, graph limits may be represented by symmetric functions on a probability space; there are natural definitions of direct sums and connectedness for such functions, and there is a perfect correspondence with the...

متن کامل

P2-CONNECTEDNESS IN L-TOPOLOGICAL SPACES

In this paper, a certain new connectedness of L-fuzzy subsets inL-topological spaces is introduced and studied by means of preclosed sets. Itpreserves some fundamental properties of connected set in general topology.Especially the famous K. Fan’s Theorem holds.

متن کامل

Connectedness in Graph Limits

We define direct sums and a corresponding notion of connectedness for graph limits. Every graph limit has a unique decomposition as a direct sum of connected components. As is well-known, graph limits may be represented by symmetric functions on a probability space; there are natural definitions of direct sums and connectedness for such functions, and there is a perfect correspondence with the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales Academiae Scientiarum Fennicae Series A I Mathematica

سال: 1990

ISSN: 0066-1953

DOI: 10.5186/aasfm.1990.1514